Subideal border bases

نویسندگان

  • Martin Kreuzer
  • Hennie Poulisse
چکیده

In modeling physical systems, it is sometimes useful to construct border bases of 0-dimensional polynomial ideals which are contained in the ideal generated by a given set of polynomials. We define and construct such subideal border bases, provide some basic properties and generalize a suitable variant of the Buchberger-Möller algorithm as well as the AVI-algorithm of [5] to the subideal setting. The subideal version of the AVI-algorithm is then applied to an actual industrial problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Module Border Bases

In this paper, we generalize the notion of border bases of zerodimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with finite codimension in a free module as a generalization of border bases of zero-dimensional ideals in the first part of this paper. In particular, we extend the d...

متن کامل

Computing from Projections of Random Points: a Dense Hierarchy of Subideals of the K-trivial Degrees

We study the sets that are computable from both halves of some (Martin-Löf) random sequence, which we call 1{2-bases. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e. elements. It is a proper subideal of the K-trivial sets. We characterise 1{2-bases as the sets computable from both halves of Chaitin’s Ω, and as the sets that obey the co...

متن کامل

Comprehensive Border Bases for Zero Dimensional Parametric Polynomial Ideals

In this paper, we extend the idea of comprehensive Gröbner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border system, and prove their existence even in the cases where they do not correspond to any term order. We further present algorithms to compute comprehensive border b...

متن کامل

A Note on Finite Dimensional Subideals of Lie Algebras

1.1 We prove that: Over any field I of characteristic p > 0, there exists an infinite dimensional Lie algebra which is the join of two (p + l)-dimensional and nilpotent (of class exactly p) subideals. A result of Hartley ([2; p. 259, theorems 2 and 5]) states that over any field of characteristic zero, the join of a pair of finite dimensional (resp. finite dimensional and nilpotent) subideals i...

متن کامل

Computing Border Bases without using a Term Ordering

Border bases, a generalization of Gröbner bases, have actively been researched during recent years due to their applicability to industrial problems. In [6] Kehrein and Kreuzer formulated the so called Border Basis Algorithm, an algorithm which allows the computation of border bases that relate to a degree compatible term ordering. In this paper we extend the original Border Basis Algorithm in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 80  شماره 

صفحات  -

تاریخ انتشار 2011